The generalized counting method for recursive logic queries

The Generalized Counting Method for Recursive Logic Queries

This paper treats the problem of implementing efficiently recursive Horn Clauses queries, including those with function symbols. In particular, the situation is studied where the initial bindings of the arguments in the recursive query goal can be used in the top-down (as in backward chaining) execution phase to improve the efficiency and, often, to guarantee the termination, of the forward cha...

Evaluation of Common Counting Method for Concurrent Data Mining Queries

Data mining queries are often submitted concurrently to the data mining system. The data mining system should take advantage of overlapping of the mined datasets. In this paper we focus on frequent itemset mining and we discuss and experimentally evaluate the implementation of the Common Counting method on top of the Apriori algorithm. The general idea of Common Counting is to reduce the number...

Experimenting with recursive queries in database and logic programming systems

This paper considers the problem of reasoning on massive amounts of (possibly distributed) data. Presently, existing proposals show some limitations: (i) the quantity of data that can be handled contemporarily is limited, due to the fact that reasoning is generally carried out in main-memory; (ii) the interaction with external (and independent) DBMSs is not trivial and, in several cases, not al...

Using Logic Programming to Eeciently Evaluate Recursive Queries

Recursive Strategies for Answering Recursive Queries - The RQA/FQI Strategy

In this paper we will discuss several methods for recursive query processing using a recursive control structure. We will describe the QSQR method, introduced in [Vie861 and show that it fails to produce all answers in certain cases. After analyzing the causes of this failure we propose an improved algorithm the RQA/FQI Strategy which is complete over the domain of function-free Horn clauses. T...